- Title
- Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages
- Creator
- Liu, Yucheng; Ong, Lawrence; Lep Yeoh, Phee; Sadeghi, Parastoo; Kliewer, Joerg; Johnson, Sarah
- Relation
- 2022 IEEE International Symposium on Information Theory (ISIT). Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT) (Espoo, Finland 01 July, 2022) p. 3256-3261
- Relation
- ARC.DP190100770 http://purl.org/au-research/grants/arc/DP190100770
- Publisher Link
- http://dx.doi.org/10.1109/isit50566.2022.9834747
- Publisher
- Institute of Electrical and Electronic Engineers (IEEE)
- Resource Type
- conference paper
- Date
- 2022
- Description
- Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the sensitive messages to the adversary. We construct a deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to a novel upper bound on the optimal information leakage rate, which is proved to be tight over all deterministic scalar linear codes. We also derive a converse result from a graph-theoretic perspective, which holds in general over all deterministic and stochastic coding schemes.
- Subject
- upper bound; minimization methods; fitting; linear codes; encoding; indexes
- Identifier
- http://hdl.handle.net/1959.13/1481710
- Identifier
- uon:50781
- Identifier
- ISSN:2157-8095
- Language
- eng
- Reviewed
- Hits: 734
- Visitors: 731
- Downloads: 0